Structure-Constrained Basis Pursuit for Compressed Sensing

نویسندگان

  • Miguel Domínguez
  • Behnaz Ghoraani
چکیده

In compressive sensing (CS) theory, as the number of samples is decreased below a minimum threshold, the average error of the recovery increases. Sufficient sampling is either required for quality reconstruction or the error is resignedly accepted. However, most CS work has not taken advantage of the inherent structure in a variety of signals relevant to engineering applications. Hence, this paper proposes a new method of recovery built on basis pursuit (BP), called Structure-Constrained Basis Pursuit (SCBP), that constrains signals based on known structure rather than through extra sampling. Preliminary assessments of this method on TIMIT recordings of the speech phoneme /A/ show a substantial decrease in error: with a fixed 5:1 compression ratio the average recovery error is 23.8% lower versus vanilla BP. More significantly, this method can be applied to any CS application that samples structured data, such as FSK waveforms, speech, and tones. In these cases, higher compression ratios can be reached with comparable error.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tv-min and Greedy Pursuit for Constrained Joint Sparsity and Application to Inverse Scattering

This paper proposes a general framework for compressed sensing of constrained joint sparsity (CJS) which includes total variation minimization (TV-min) as an example. The gradientand 2-norm error bounds, independent of the ambient dimension, are derived for the CJS version of Basis Pursuit and Orthogonal Matching Pursuit. As an application the results extend Candès, Romberg and Tao’s proof of e...

متن کامل

A Block-Wise random sampling approach: Compressed sensing problem

The focus of this paper is to consider the compressed sensing problem. It is stated that the compressed sensing theory, under certain conditions, helps relax the Nyquist sampling theory and takes smaller samples. One of the important tasks in this theory is to carefully design measurement matrix (sampling operator). Most existing methods in the literature attempt to optimize a randomly initiali...

متن کامل

Robustness to unknown error in sparse regularization

Quadratically-constrained basis pursuit has become a popular device in sparse regularization; in particular, in the context of compressed sensing. However, the majority of theoretical error estimates for this regularizer assume an a priori bound on the noise level, which is usually lacking in practice. In this paper, we develop stability and robustness estimates which remove this assumption. Fi...

متن کامل

A First-Order Augmented Lagrangian Method for Compressed Sensing

We propose a first-order augmented Lagrangian algorithm (FAL) for solving the basis pursuit problem. FAL computes a solution to this problem by inexactly solving a sequence of `1-regularized least squares sub-problems. These sub-problems are solved using an infinite memory proximal gradient algorithm wherein each update reduces to “shrinkage” or constrained “shrinkage”. We show that FAL converg...

متن کامل

The Sensitivity to Basis Mismatch of Compressed Sensing for Spectrum Analysis and Beamforming

The theory of compressed sensing suggests that successful inversion of an image of the physical world (e.g., a radar/sonar return or a sensor array snapshot vector) for the source modes and amplitudes can be achieved at measurement dimensions far lower than what might be expected from the classical theories of spectrum or modal analysis, provided that the image is sparse in an apriori known bas...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1510.03709  شماره 

صفحات  -

تاریخ انتشار 2015